Domain-theoretical models of parametric polymorphism
نویسندگان
چکیده
منابع مشابه
Domain-theoretical models of parametric polymorphism
We present a domain-theoretic model of parametric polymorphism based on admissible per’s over a domain-theoretic model of the untyped lambda calculus. The model is shown to be a model of Abadi & Plotkin’s logic for parametricity, by the construction of an LAPL-structure as defined by the authors in [7, 5]. This construction gives formal proof of solutions to a large class of recursive domain eq...
متن کاملDomain-theoretic models of parametric polymorphism
We present a domain-theoretic model of parametric polymorphism based on admissible per’s over a domain-theoretic model of the untyped lambda calculus. The model is shown to be a model of Abadi & Plotkin’s logic for parametricity, by the construction of an LAPL-structure as defined by the authors in [7, 5]. This construction gives formal proof of solutions to a large class of recursive domain eq...
متن کاملInterpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism
This paper shows how parametric PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using recent results about solutions to recursive domain equations in parametric models of PILLY , we show how to interpret FPC in these. Of particular interest is ...
متن کاملDomain Theoretic Models of Polymorphism
We give an illustration of a construction useful in producing and describing models of Girard and Reynolds' polymorphic λ-calculus. The key unifying ideas are that of a Grothendieck fibration and the category of continuous sections associated with it, constructions used in indexed category theory; the universal types of the calculus are interpreted as the category of continuous sections of the ...
متن کاملFrom parametric polymorphism to models of polymorphic FPC
This paper shows how PILLY (Polymorphic Intuitionistic / Linear Lambda calculus with a fixed point combinator Y ) with parametric polymorphism can be used as a metalanguage for domain theory, as originally suggested by Plotkin more than a decade ago. Using Plotkin’s encodings of recursive types in PILLY we show how parametric models of PILLY give rise to models of FPC, a simply typed lambda cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.06.016